The Automatic Memory Stack and Stack Manipulation. This calculator uses "Reverse Polish Notation"(RPN), whereby algebraic operators are specified(entered) **after** specifying(entering) the variable(s). This allows for the solution of complicated calculations in a straightforward manner without parentheses or punctuation. It does so by automatically retaining and returning intermediate results. This system is implemented through the automatic memory stack and the ENTER key, minimizing total keystrokes.
The Automatic Memory Stack
T 0.000
Z 0.000
Y 0.000
X 0.000 Always displayed.
Any number that is keyed in or results from the execution of a numeric function is placed in the display(X-register). This action will cause numbers already in the stack to lift, remain in the same register or drop, depending upon both the immediately preceding and the current operation. Numbers in the stack are stored on a last-in, first-out basis. The three dstacks drawn below illustrate the three types of stack movement. Assume x, y, z, and t represent any numbers which may be in the stack.
Stack Lift
|----------> lost
T t--| |--------> z
Z z----| |------> y
Y y------| |----> x
X x--------| |--> π
|
Keys: g π
No Stack Lift or Drop
T t-------------> t
Z z-------------> z
Y y-------------> y
X x-------------> ‚àöx
Keys: ‚àöx
Stack Drop
T t-------|-----> t
Z z-----| |-----> t
Y y---| |-------> z
X x---|---------> x + y
Keys: +
Notice that the number in the T-register remains there when the stack drops, allowing this number to be used repetitively as an arithmetic constant.